Simple-motion pursuit-evasion in the half plane
نویسندگان
چکیده
منابع مشابه
Visibility-Based Pursuit-Evasion in the Plane
The speed at which robots begin to enter various application domains is now largely dependent on the availability of robust and efficient algorithms that are capable of solving the complex planning problems inherent to the given domain. This talk will present a line of research that makes progress towards solving some of the complex planning problems found in target tracking applications where ...
متن کاملConstrained Pursuit - Evasion Problems in the Plane
In pursuit-evasion problems, we are presented with one or more pursuers attempting to capture one or more evaders. We consider pursuers and evaders limited by a maximum speed moving in the two-dimensional plane with obstacles. We then investigate two problems in this domain. In the first, where we are given the starting configuration of pursuers and evaders, we identify all possible paths by th...
متن کاملPursuit and Evasion: Evolutionary Dynamics and Collective Motion
Pursuit and evasion strategies are used in both biological and engineered settings; common examples include predator-prey interactions among animals, dogfighting aircraft, car chases, and missile pursuit with target evasion. In this paper, we consider an evolutionary game between three strategies of pursuit (classical, constant bearing, motion camouflage) and three strategies of evasion (classi...
متن کاملPursuit- Evasion Games
Two players, Red and Blue, each independently choose a vertex of a connected graph G. Red must then pay Blue an amount equal to the distance between the vertices chosen. In this note, w e investigate the value v(G) of this pursuit-evasion game for various classes of graphs G, as well as those optimal mixed strategies for achieving v(G). It is shown that some rather counterintuitive behavior can...
متن کاملRandomized Pursuit-Evasion in Graphs
We analyze a randomized pursuit-evasion game on graphs. This game is played by two players, a hunter and a rabbit. Let G be any connected, undirected graph with n nodes. The game is played in rounds and in each round both the hunter and the rabbit are located at a node of the graph. Between rounds both the hunter and the rabbit can stay at the current node or move to another node. The hunter is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1987
ISSN: 0898-1221
DOI: 10.1016/0898-1221(87)90094-0